A Study of Relationship between RSA Public Key Cryptosystem and Goldbach's Conjecture Properties

نویسندگان

  • Chenglian Liu
  • Chin-Chen Chang
  • Zhi-Pan Wu
  • Shi-Lin Ye
چکیده

The Goldbach’s conjecture has plagued mathematicians for over two hundred and seventy years. Whether professionals or amateur enthusiasts, all have been fascinated by this question. Why do mathematicians have no way to solve this problem? Till now, Chen has been recognized for the most concise proof his “1 + 2” theorem in 1973. In this article the authors will use elementary concepts to describe and indirectly prove the Goldbach conjecture.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Study of Relationship Among Goldbach Conjecture, Twin Prime and Fibonacci Number

In 2015, Liu et al. proposed a study relationship between RSA public key cryptosystem and Goldbach’s conjecture properties. They discussed the relationship between RSA and Goldbach conjecture, twin prime and Goldbach conjecture. In this paper the author will extend to introduce the relationsip among Goldbach conjecture, twin prime and Fibonacci number. Based on their contribution, the author co...

متن کامل

QTRU: quaternionic version of the NTRU public-key cryptosystems

In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...

متن کامل

LUC: A New Public Key System

We describe public key cryptosystems and analyse the RSA cryptosystem, pointing out a weakness (already known) of the RSA system. We define Lucas functions and derive some of their properties. Then we introduce a public key system based on Lucas functions instead of exponentiation. The computational requirements of the new system are only a little greater than those for the RSA system, and we p...

متن کامل

New public-key cryptosystems with fast decryption

ii iii Acknowledgements First of all, I would like to thank Prof. Johannes Buchmann for giving me the opportunity to join his research group, organizing the joint research between TUD and NTT, and promoting this doctor thesis as my supervisor. His suggestions and helpful support improve this work significantly. I would also like to thank Prof. Kouichi Sakurai for accepting the task of the secon...

متن کامل

A First Study of the Neural Network Approach in the Rsa Cryptosystem

The RSA cryptosystem is supposed to be the first realization of a public key cryptosystem in 1977. Its (computational) security is relied upon the difficulty of factorization. In order to break the RSA cryptosystem it is enough to factorize where is the product of two large prime numbers, . This is equivalent to calculate where is the Euler function. In this paper Neural Networks are trained in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • I. J. Network Security

دوره 17  شماره 

صفحات  -

تاریخ انتشار 2015